Independent set - PDFSEARCH.IO - Document Search Engine

Independent set
Results: 651

#	Item
51	Brief Announcement: Local Approximability of Minimum Dominating Set on Planar Graphs Miikka Hilke Christoph Lenzen Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2015-05-29 10:12:03 Graph theory NP-complete problems Combinatorial optimization Planar graphs Dominating set Matching Graph coloring Maximal independent set
52	Contributions on Secretary Problems, Independent Sets of Rectangles and Related Problems by José Antonio Soto Submitted to the Department of Mathematics Add to Reading List Source URL: www.dim.uchile.cl Language: English - Date: 2013-08-08 17:44:26 Graph theory Mathematics Matroid theory Discrete mathematics Matroid Graphic matroid Bipartite graph Submodular set function Combinatorics Perfect graph Linear programming Matroid oracle
53	Computing and Counting Longest Paths on Circular-Arc Graphs in Polynomial Time Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2011-12-14 14:46:08 NP-complete problems Circular-arc graph Longest path problem Hamiltonian path Interval graph Intersection graph Independent set Graph theory Pathwidth Trapezoid graph
54	On the Parameterized Complexity for Token Jumping on Graphs Takehiro Ito1 , Marcin Kami´ nski2 , Hirotaka Ono3 , 1 4 Add to Reading List Source URL: rutcor.rutgers.edu Language: English - Date: 2014-04-14 14:04:38 NP-complete problems Graph theory Network theory Edsger W. Dijkstra Shortest path problem Maximal independent set Independent set Matching Bipartite graph Degree Graph Line graph
55	Brief Announcement: Efficient Graph Algorithms without Synchronization Johannes Schneider Roger Wattenhofer Add to Reading List Source URL: disco.ethz.ch Language: English - Date: 2014-09-26 08:36:28 Graph coloring Combinatorial optimization Distributed computing Matching Maximal independent set Edge coloring
56	Journal of Complex Networks, 177–186 doi:comnet/cnv020 Advance Access publication on 21 July 2015 Network installation under convex costs Alexander Gutfraind† Add to Reading List Source URL: www.levreyzin.com Language: English - Date: 2016-07-01 10:19:11 NP-complete problems Clique problem Vertex cover Clique Independent set Bipartite graph Travelling salesman problem Graph coloring Line graph Treewidth Pathwidth
57	Moment methods in energy minimization David de Laat Delft University of Technology (Joint with Fernando Oliveira and Frank Vallentin) L´aszl´ Add to Reading List Source URL: www.daviddelaat.nl Language: English Operations research Discrete geometry NP-complete problems Conjectures Circle packing Sphere packing Independent set Kepler conjecture Tammes problem Mathematical optimization Semidefinite programming FranklRdl graph
58	CS261: A Second Course in Algorithms Lecture #19: Beating Brute-Force Search∗ Tim Roughgarden† March 8, 2016 A popular myth is that, for N P -hard problems, there are no algorithms with worst-case running time better Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-03-15 10:47:56 NP-complete problems Computational complexity theory Analysis of algorithms Operations research NP-hard problems Vertex cover Travelling salesman problem Dynamic programming Parameterized complexity Independent set Algorithm 2-satisfiability
59	Maximal Strip Recovery Problem with Gaps: Hardness and Approximation AlgorithmsI Laurent Bulteau, Guillaume Fertin, Irena Rusu Laboratoire d’Informatique de Nantes-Atlantique (LINA), UMR CNRS 6241 Université de Nantes Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2013-01-07 10:28:20 Computational problems NP-complete problems Optimization problem Synteny Independent set
60	Tight Bounds for Distributed Selection Fabian Kuhn Institute of Theoretical Computer Science ETH Zurich, Switzerland Add to Reading List Source URL: www.tik.ee.ethz.ch Language: English - Date: 2015-05-18 12:16:23 Analysis of algorithms Probabilistic complexity theory Randomized algorithm Selection algorithm B-tree Oblivious data structure Maximal independent set

UPDATE